/*
#include<bits/stdc++.h>
using namespace std;
int main()
{
  int o = 0, l = 0;
  double n = 23333333;
  for (o = 0;o <= n / 2; o ++)
  {
    double sum = 0;
    sum -= (o / n) * log2(o / n) * o + (n - o) / n * log2((n - o) / n) * (n - o);
    if (sum > 11625907.5 && sum < 11625907.6)
    {
      cout << o;
      break;
    }
  }
  return 0;
}
*/
/*
#include<bits/stdc++.h>
using namespace std;
const int N = 1e3 + 10;
int a[N], b[N];
int n;
int main()
{
  scanf("%d", &n);
  for (int i = 1; i < n; i ++)
  {
    scanf("%d %d", &a[i], &b[i]);
  }
  for (int i = 1; i <= 1e6; i ++)
  {
    int flag = 1;
    for (int j = 0; j < n; j ++)
    {
      if (b[j] != (a[j] / i))
      {
        flag = 0;
        break;
      }
    }
    if(flag == 1)
    {
      cout << i << " ";
      break;
    }
  }
  for (int i = 1e6; i >= 1; i --)
  {
    int flag = 1;
    for (int j = 0; j < n; j ++)
    {
      if (b[j] != (a[j] / i))
      {
        flag = 0;
        break;
      }
    }
    if(flag == 1)
    {
      cout << i << " ";
      break;
    }
  }
  return 0;
}
*/
